A Small World Overlay Network for Semantic Based Search in P2P Systems

نویسندگان

  • Mei Li
  • Wang-Chien Lee
  • Anand Sivasubramaniam
  • Dik Lun Lee
چکیده

For a peer-to-peer (P2P) system holding massive amount of data, efficient search for resources (such as data or services) is a key determinant to its scalability. This paper presents semantic small world (SSW), an overlay network and index structure for semantic based P2P search. By dynamically clustering peer nodes in a semantic space based on the semantics of their data and organizing the clusters into a small world network, SSW achieves a very competitive trade-off between the search latencies/traffic and maintenance overheads. Preliminary evaluation shows that SSW is much more scalable to very large network sizes and very large numbers of data objects compared to pSearch, the stateof-the-art semantic-based search technique for P2P systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bittella: A new protocol for unstructured p2p networks based on the Small World per Content Structure

In this paper we propose a new protocol for unstructured and semantic-searching based p2p networks: Bittella. It forms a three level overlay network: the lower level is the unstructured p2p network (e.g. Gnutella). The medium level is formed by clusters per content, we call the resulting structure Small World per Content structure. This level allows the utilization of Bittorrent-like download t...

متن کامل

Bittella: Optimizing the download time and the search procedure on unstructured p2p networks based on Small Worlds

In this paper we propose a new protocol for unstructured and semantic-searching based p2p networks: Bittella. It forms a three level overlay network: the lowest level is the unstructured p2p network (e.g. Gnutella). The medium level is formed by clusters per content, we call the resulting structure Small World per Content structure. This level allows the utilization of Bittorrent-like download ...

متن کامل

Content-Based Peer-to-Peer Network Overlay for Full-Text Federated Search

Peer-to-peer network overlays have mostly been designed to support search over document names, identifiers, or keywords from a small or controlled vocabulary. In this paper we propose a content-based P2P network overlay for full-text federated search over heterogeneous, open-domain contents. Local algorithms are developed to dynamically construct a network overlay with content-based locality an...

متن کامل

Modeling a Semantic Overlay across P2P Collaborative Systems

Recent distributed systems, in a P2P scenario, are characterized by a set of independent peers that dynamically need to cooperate by sharing data and services. For effective collaboration, under highly dynamic conditions and in absence of a global view of the resources shared across the information systems, semantic modeling tools need be defined. In particular, the emergence of semantics is a ...

متن کامل

Distributed Suffix Tree for Peer-to-Peer Search

Establishing an appropriate semantic overlay on Peer-to-Peer networks to obtain both semantic ability and scalability is a challenge. Current DHT-based P2P networks are limited in their ability to support semantic search. This paper proposes the DST (Distributed Suffix Tree) overlay as the intermediate layer between the DHT overlay and the semantic overlay. The DST overlay supports search of ke...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004